package DiErZhou.Day2;

public class Day1_3 {
    public static void main(String[] args) {
        for (int i = 0; i <= 34; i++) {
            int count=0;
            for (int j = 0; j <=50; j++) {
                for (int k = 0; k <=100; k++) {
                    if ((i+j+k==100)&&(i*3+j*2+k/2==100)&&(k%2==0)){
                        count++;
                        System.out.println("第"+count+"种"+"大马的数量是：" + i+"\t中马的数量是："
                                + j+"\t小马的数量是： " + k);


                    }
                }
            }
        }

    }
}
